public class LeetCode136 {
    public static void main(String[] args) {
        //只出现一次的数字
        //https://leetcode.cn/problems/single-number/description/
    }
}

class Solution {
    public int singleNumber(int[] nums) {
        int count = nums[0];
        for(int i = 1; i < nums.length; i++){
            count^=nums[i];
        }
        return count;
    }
}
